Two sufficient conditions for rectifiable measures

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two Sufficient Conditions for Rectifiable Measures

We identify two sufficient conditions for locally finite Borel measures on R to give full mass to a countable family of Lipschitz images of R. The first condition, extending a prior result of Pajot, is a sufficient test in terms of L affine approximability for a locally finite Borel measure μ on R satisfying the global regularity hypothesis lim sup r↓0 μ(B(x, r))/r <∞ at μ-a.e. x ∈ R to be m-re...

متن کامل

Multiscale Analysis of 1-rectifiable Measures: Necessary Conditions

We repurpose tools from the theory of quantitative rectifiability to study the qualitative rectifiability of measures in R, n ≥ 2. To each locally finite Borel measure μ, we associate a function J̃2(μ, x) which uses a weighted sum to record how closely the mass of μ is concentrated near a line in the triples of dyadic cubes containing x. We show that J̃2(μ, ·) < ∞ μ-a.e. is a necessary condition ...

متن کامل

Sufficient conditions for univalence and starlikeness

It is known that the condition $mathfrak {Re} left{zf'(z)/f(z)right}>0$, $|z|

متن کامل

Two simple sufficient conditions for FDR control

We show that the control of the false discovery rate (FDR) for a multiple testing procedure is implied by two coupled simple sufficient conditions. The first one, which we call “self-consistency condition”, concerns the algorithm itself, and the second, called “dependency control condition” is related to the dependency assumptions on the p-value family. Many standard multiple testing procedures...

متن کامل

Two sufficient conditions for dominating cycles

A cycle C of a graph G is dominating if each component of GnC is edgeless. In the paper, we will give two sufficient conditions for each longest cycle of a 3-connected graph to be a dominating cycle. 2005 Wiley Periodicals, Inc. J Graph Theory 49: 135–150, 2005

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2015

ISSN: 0002-9939,1088-6826

DOI: 10.1090/proc/12881